Verifying a Self - Stabilizing Mutual Exclusion
نویسنده
چکیده
We present a detailed description of a machine-assisted veriication of an algorithm for self-stabilizing mutual exclusion that is due to Dijkstra Dij74]. This veriication was constructed using PVS. We compare the mechanical veriication to the informal proof sketch on which it is based. This comparison yields several observations regarding the challenges of formalizing and mechanically verifying distributed algorithms in general.
منابع مشابه
A Highly Safe Self-Stabilizing Mutual Exclusion Algorithm
Conventional self-stabilizing algorithms cannot be used for safety-critical systems due to the period of vulnerability that exists after a transient failure occurs till the system stabilizes. In this paper, we consider a highly safe self-stabilizing system where the vulnerability problem is tackled. The design principles we use to achieve this goal include sobriety test and processor specializa...
متن کاملSelf-stabilizing mutual exclusion on a ring, even if K=N
We show that, contrary to common belief, Dijkstra’s self-stabilizing mutual exclusion algorithm on a ring [Dij74, Dij82] also stabilizes when the number of states per node is one less than the number of nodes on the ring. keywords: distributed computing, fault tolerance, self-stabilization.
متن کاملA Universal Self-Stabilizing Mutual Exclusion Algorithm
A distributed system is said to be self-stabilizing if it converges to a correct system state from any initial system state in finite number of steps. Such a self-stabilizing system can be regarded as a fault tolerant system against transient faults since by definition it autonomously returns to a correct system state, no matter how maliciously variables and buffers are rewritten. In this paper...
متن کاملSelf-Stabilizing Distributed Local Mutual Exclusion
A self-stabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. The process identifiers are said to be chromatic if no two processes neighboring each other have th...
متن کاملA Universal Self - Stabilizing Mutual Exclusion Algorithm ∗ 3 Q @ nM 5 < ! 9 - EgBg
A distributed system consists of a set of processes and a set of communication links. A distributed system is said to be self-stabilizing if it converges to a correct system state from arbitrary initial system states. A self-stabilizing system is considered to be a fault tolerant system , since it tolerates any kind and any finite number of transient failures. The leader election and mutual exc...
متن کامل